MATHEMATICAL ENGINEERING TECHNICAL REPORTS Practical Efficiency of Maximum Flow Algorithms Using MA Orderings

Practical Efficiency of Maximum Flow Algorithms Using Ma Orderings and Preflows

Fujishige proposed a polynomial-time maximum flow algorithm using maximum adjacency (MA) orderings. Computational results by Fujishige and Isotani showed that the algorithm was slower in practice than Goldberg and Tarjan’s algorithm. In this paper we propose an improved version of Fujishige’s algorithm using preflows. Our computational results show that the improved version is much faster than ...

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Use of Primal-Dual Technique in the Network Algorithm for Two-Way Contingency Tables

The network algorithm of Mehta and Patel is one of the most efficient algorithms to execute a generalized Fisher’s exact test in two-way contingency tables. In this article an efficient algorithm for solving the longest path problem in the network algorithm is proposed. The efficiency of the proposed algorithm relies on the primal dual technique for convex network flow problems and the use of m...

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Practical Algorithms for Two-dimensional Packing

Machine learning algorithms for time series in financial markets

This research is related to the usefulness of different machine learning methods in forecasting time series on financial markets. The main issue in this field is that economic managers and scientific society are still longing for more accurate forecasting algorithms. Fulfilling this request leads to an increase in forecasting quality and, therefore, more profitability and efficiency. In this pa...

Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...